Minimal Unsatisfiability and Autarkies
نویسندگان
چکیده
The topic of this chapter is the study of certain forms of “redundancies” in propositional conjunctive normal forms and generalisations. In Sections 11.1 11.7 we study “minimally unsatisfiable conjunctive normal forms” (and generalisations), unsatisfiable formulas which are irredundant in a strong sense, and in Sections 11.8 11.13 we study “autarkies”, which represent a general framework for considering redundancies. Finally in Section 11.14 we collect some main open problems.
منابع مشابه
Efficient Autarkies
Autarkies are partial truth assignments that satisfy all clauses having literals in the assigned variables. Autarkies provide important information in the analysis of unsatisfiable formulas. Indeed, clauses satisfied by autarkies cannot be included in minimal explanations or in minimal corrections of unsatisfiability. Computing the maximum autarky allows identifying all such clauses. In recent ...
متن کاملConstraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability
We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, where our goal is to maintain combinatorial properties. Requiring that a literal involves only a single variable, the most general form of literals is given by the well-known “signed literals”, however we will argue that only the most restricted form of generalised clause-sets,...
متن کاملSearching for Autarkies to Trim Unsatisfiable Clause Sets
An autarky is a partial assignment to the variables of a Boolean CNF formula that satisfies every clause containing an assigned variable. For an unsatisfiable formula, an autarky provides information about those clauses that are essentially independent from the infeasibility; clauses satisfied by an autarky are not contained in any minimal unsatisfiable subset (MUS) or minimal correction subset...
متن کاملAn Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas
The notion of minimal unsatisfiability and minimal falsity will be extended to nonclausal and non-prenex quantified Boolean formulas. For quantified Boolean formulas in negation normal form we generalize the notion of deficiency to the so-called cohesion, which is 1+ the difference between the number of occurrences of the conjunction symbol ∧ and the number of existential and free variables. Fu...
متن کاملALGORITHMIC PROPERTIES OF AUTARKIES Algorithmic properties of autarkies
Autarkies arise in studies of satisfiability of CNF theories. In this paper we extend the notion of an autarky to arbitrary propositional theories. We note that in this general setting autarkies are related to the 3-valued logic. Most of our results are concerned with algorithmic properties of autarkies. We prove that the problem of the existence of autarkies is NP-complete and that, as in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009